888B - Buggy Robot - CodeForces Solution


greedy *1000

Please click on ads to support us..

Python Code:

def solve():
    n = int(input().strip())
    arr = input().split()[0]
    up_down = 0
    left_right = 0
    
    for i in range(0,n):
        if arr[i] == 'U':
            up_down += 1
        elif arr[i] == 'D':
            up_down -= 1
        elif arr[i] == 'L':
            left_right += 1
        elif arr[i] == 'R':
            left_right -= 1
        else:
            continue

    print(n-abs(up_down)-abs(left_right))

solve()


Comments

Submit
0 Comments
More Questions

1237A - Balanced Rating Changes
1616A - Integer Diversity
1627B - Not Sitting
1663C - Pōja Verdon
1497A - Meximization
1633B - Minority
688B - Lovely Palindromes
66B - Petya and Countryside
1557B - Moamen and k-subarrays
540A - Combination Lock
1553C - Penalty
1474E - What Is It
1335B - Construct the String
1004B - Sonya and Exhibition
1397A - Juggling Letters
985C - Liebig's Barrels
115A - Party
746B - Decoding
1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping
237A - Free Cash
1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale